A Denotational Semantics for Curry
نویسندگان
چکیده
We aim to build a denotational semantics for the functional logic programming language Curry, to be used for parametricity and logical relation arguments. First, we investigate only a subset of Curry, but include the important features that separate Curry from a just functional language. We compare a poweralgebraic and a multialgebraic semantic approach and motivate our decision for the multialgebraic one. Afterwards, we describe how general recursion and lists, as an example for algebraic data types, can be added.
منابع مشابه
Institut für Informatik III der Rheinischen Friedrich-Wilhelms-Universität Bonn An Adequate, Denotational, Functional-Style Semantics for Typed FlatCurry without Letrec
With the aim of putting type-based reasoning for functional logic languages, as recently explored by Christiansen et al. (2010), on a formal basis, we develop a denotational semantics for a typed core language of Curry. Dealing with the core language FlatCurry rather than with full Curry suffices, since there exists a type-preserving translation from the latter into the former. In contrast to e...
متن کاملThe stack calculus
We introduce a functional calculus with simple syntax and operational semantics in which the calculi introduced so far in the Curry–Howard correspondence for Classical Logic can be faithfully encoded. Our calculus enjoys confluence without any restriction. Its type system enforces strong normalization of expressions and it is a sound and complete system for full implicational Classical Logic. W...
متن کاملAn Adequate, Denotational, Functional-Style Semantics for Typed FlatCurry
With the aim of putting type-based reasoning for functional logic languages, as recently explored by Christiansen et al. (2010), on a formal basis, we develop a denotational semantics for a typed core language of Curry. Dealing with the core language FlatCurry rather than with full Curry suffices, since there exists a type-preserving translation from the latter into the former. In contrast to e...
متن کاملOn Semantics of a Term Calculus for Classical Logic
The calculus of Curien and Herbelin was introduced to provide the Curry–Howard correspondence for classical logic. The terms of this calculus represent derivations in the sequent calculus proof system and reduction reflects the process of cut-elimination. We investigate some properties of two well-behaved subcalculi of untyped calculus of Curien and Herbelin, closed under the call-by-name and t...
متن کاملUnifying static and dynamic denotational semantics
This work deals with semantics of programming languages (or equivalently, thanks to Curry-Howard isomorphism, with semantics of proofs). We introduce a framework in which both static semantics (Ehrhard’s hypercoherences) and dynamic semantics (Hyland-Ong’s games), can be presented. The work is carried in a multiplicative subsystem of Laurent’s polarized linear logic with weakening. Like Böhm tr...
متن کامل